Maximally Fast Numerically Equivalent State-space Recursive Digital Filters Using Distributed Arithmetic

A method to achieve maximally fast (rate-optimal) recursive filters implemented using distributed arithmetic is presented. The filters will have the same upper bound on the sample frequency as if they were implemented using bit-serial multipliers and adders. Maximally fast implementation is important for high-speed recursive filters, but also as any excess speed can be traded for low power consumption by lowering the supply voltage. A method for decreasing the latency of certain inputs of distributed arithmetic is also presented.